on numerical semigroups with embedding dimension three
نویسندگان
چکیده
let $fneq1,3$ be a positive integer. we prove that there exists a numerical semigroup $s$ with embedding dimension three such that $f$ is the frobenius number of $s$. we also show that the same fact holds for affine semigroups in higher dimensional monoids.
منابع مشابه
On Numerical Semigroups with Embedding Dimension Three
Let f ̸= 1, 3 be a positive integer. We prove that there exists a numerical semigroup S with embedding dimension three such that f is the Frobenius number of S. We also show that the same fact holds for affine semigroups in higher dimensional monoids.
متن کاملFactoring in Embedding Dimension Three Numerical Semigroups
Let us consider a 3-numerical semigroup S = 〈a, b,N 〉. Given m ∈ S, the triple (x, y, z) ∈ N3 is a factorization of m in S if xa+ yb+ zN = m. This work is focused on finding the full set of factorizations of any m ∈ S and as an application we compute the catenary degree of S. To this end, we relate a 2D tessellation to S and we use it as a main tool.
متن کاملNumerical semigroups with maximal embedding dimension
Even though the study and relevance of maximal embedding dimension numerical semigroups arises in a natural way among the other numerical semigroups, they have become specially renowned due to the existing applications to commutative algebra via their associated semigroup ring (see for instance [1, 5, 15, 16, 99, 100]). They are a source of examples of commutative rings with some maximal proper...
متن کاملSymmetric Numerical Semigroups with Arbitrary Multiplicity and Embedding Dimension
We construct symmetric numerical semigroups S for every minimal number of generators μ(S) and multiplicity m(S), 2 ≤ μ(S) ≤ m(S) − 1. Furthermore we show that the set of their defining congruence is minimally generated by μ(S)(μ(S) − 1)/2 − 1 elements.
متن کاملThe Frobenius problem for numerical semigroups with embedding dimension equal to three
If S is a numerical semigroup with embedding dimension equal to three whose minimal generators are pairwise relatively prime numbers, then S = 〈a, b, cb − da〉 with a, b, c, d positive integers such that gcd(a, b) = gcd(a, c) = gcd(b, d) = 1, c ∈ {2, . . . , a− 1}, and a < b < cb− da. In this paper we give formulas, in terms of a, b, c, d, for the genus, the Frobenius number, and the set of pseu...
متن کاملChomp on numerical semigroups
We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies for chomp is strongly related to classical properties of semigroups. We characterize which player has a winning-strategy for symmetric semigroups, semigroups of maximal embedding dimension and several families of numerical semigroups generated by arithmetic sequences. Furt...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
transactions on combinatoricsجلد ۶، شماره ۲، صفحات ۱-۶
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023